PREEMPTIVE PRIORITY SCHEDULING WITH AGING TECHNIQUE FOR EFFECTIVE DISASTER MANAGEMENT IN CLOUD
نویسندگان
چکیده
منابع مشابه
The Use of Preemptive Priority-Based Scheduling
In January 1991, the European Space Agency commissioned a study into the practicality of using process-based scheduling techniques in an on-board application environment, with Ada as the implementation language. This short paper summarises the results of that study.
متن کاملOn Fixed Priority Preemptive Scheduling for Imprecise Computation
We present new results in fixed priority scheduling for imprecise computation in real-time systems. Imprecise computation has not been popularized enough for reasons which are rooted from the task model, scheduling methods (EDF-based) and general system support. Audsley et al. have devised schedulability tests for guaranteeing mandatory computation while incorporating unbounded optional compone...
متن کاملA preemptive scheduling technique for OBS networks with service differentiation
Existing burst scheduling techniques could be improved in terms of bandwidth utilization and QoS support. In this paper, we introduced a new partially preemptive scheduling technique with QoS support. The technique is capable of handling data bursts in parts and may use preemption due to the priorities of data bursts in a multi-service OBS network environment. Simulation studies suggest that mo...
متن کاملExact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which th...
متن کاملPriority IO Scheduling in the Cloud
Current state of the art runtime systems, built for managing cloud environments, almost always assume resource sharing among multiple users and applications. In large part, these runtime systems rely on functionalities of the node-local operating systems to divide the local resources among the applications that share a node. While OSes usually achieve good resource sharing by creating distinct ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graduate Research in Engineering and Technology
سال: 2013
ISSN: 2320-6632
DOI: 10.47893/gret.2013.1035